A review of dynamic vehicle routing problems
نویسندگان
چکیده
منابع مشابه
A review of dynamic vehicle routing problems
Journal : European Journal of Operational Research State : Accepted manuscript doi:10.1016/j.ejor.2012.08.015 Abstract : A number of technological advances have led to a renewed interest on dynamic vehicle routing problems. This survey classiVes routing problems from the perspective of information quality and evolution. After presenting a general description of dynamic routing, we introduce the...
متن کاملPricing in Dynamic Vehicle Routing Problems
The principal focus of this paper is to study carrier pricing decisions for a type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the Vehicle Routing Problem in a Competitive Environment (VRPCE), as an extension of the Traveling Salesman Problem with Profits (TSPP) to a dynamic competitive auction environment. In the VRPCE, the carrier must e...
متن کاملA Review on the Evolution of Vehicle Routing Problems
This paper provides an indepth review on evolution of vehicle routing problems from savings matrix to time dependent vehicle routing problems. It is suggested that as to how VRPBH framework of Goetschalckx and Jacobs-Blecha has offered better solution to routing problems that Clarke-Wright Savings matrix and with the introduction of time -window concept the result of heuristic has improved dras...
متن کاملDynamic Vehicle Routing Problems: State Of The Art and Prospects
This scientific report summarizes the results of a literature review on dynamic vehicle routing problems. After a brief description of vehicle routing problems in general, a classification is introduced to distinguish between static and dynamic problems. Then a more precise definition of dynamism is presented, supported by example of real-world applications of such problems. Finally, a detailed...
متن کاملOnline vehicle routing problems
The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years; two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2013
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.08.015